Viability Kernels in H
نویسندگان
چکیده
In this paper, we study two new methods for approximating the viability kernel of a given set for a HH olderian diierential inclusion. We approximate this kernel by viability kernels for discrete dynam-ical systems. We prove a convergence result when the diierential inclusion is replaced by a sequence of recursive inclusions. Furthermore , when the given set is approached by a sequence of suitable nite sets, we prove our second main convergence result. This paper is the rst step to obtain numerical methods.
منابع مشابه
Some Examples of Analytically Constructed Viability Kernels for Linear Differential Games
Necessary and suucient conditions for the viability of diierential games with linear dynamics are proposed. Two illustrative examples show how to nd the largest subsets of state constraints with the viability property (viability kernels). These examples demonstrate the relative simplicity of the structure of viability kernels.
متن کاملStructure of Viability Kernels for Some Linear Differential Games
A convenient form of necessary and sufficient conditions of viability for differential games with linear dynamics is proposed. These conditions are utilized to construct maximal viable subsets of state constraints, viability kernels, in two illustrative two-dimensional examples. These examples demonstrate the relative simplicity of the structure of the viability kernels. It was found that the b...
متن کاملA Summary of Recent Progress on Efficient Parametric Approximations of Viability and Discriminating Kernels
Viability and discriminating kernels are powerful constructs for analyzing system safety through model checking, but until recently the only computational algorithms available were nonparametric gridbased approaches which, although accurate, scaled exponentially with the dimension of the system’s state space. In contrast, several polynomial complexity reachability algorithms have been developed...
متن کاملAn anti-diffusive scheme for viability problems
This paper is concerned with the numerical approximation of viability kernels. The method described here provides an alternative approach to the usual viability algorithm. We first consider a characterization of the viability kernel as the value function of a related optimal control problem, and then use a specially relevant numerical scheme for its approximation. Since this value function is d...
متن کاملThe calculation of discriminating kernel based on viability kernel and reachability
We discuss the calculation of discriminating kernel for the discrete-time dynamic game and continuous-time dynamic game (namely differential game) using the viability kernel and reachable set. For the discrete-time dynamic game, we give an approximation of the viability kernel by the maximal reachable set. Then, based on the relationship between viability and discriminating kernels, we propose ...
متن کامل